A fast & accurate non-iterative algorithm for regularized non-Cartesian MRI
نویسندگان
چکیده
We introduce a novel algorithm for regularized reconstruction of non-Cartesian MRI data. The proposed noniterative scheme closely approximates the Tikhonov regularized least squares method, but provides a significant speed up over standard implementation based on iterative conjugate gradient algorithm. This computational complexity of the proposed scheme is comparable to that of gridding. However, the proposed scheme is significantly more robust to undersampling and measurement noise. Numerical simulations clearly demonstrate the advantages of the proposed algorithm over traditional schemes. The proposed algorithm may be very useful in dynamic and functional MRI applications, where the fast reconstruction of several undersampled images is required.
منابع مشابه
Iterative Reconstruction Methods for Non-cartesian Mri
For magnetic resonance imaging (MRI) with Cartesian k-space sampling, a simple inverse FFT usually suffices for image reconstruction. More sophisticated image reconstruction methods are needed for non-Cartesian k-space acquisitions. Regularized least-squares methods for image reconstruction involve minimizing a cost function consisting of a least-squares data fit term plus a regularizing roughn...
متن کاملPython Non-Uniform Fast Fourier Transform (PyNUFFT): multi-dimensional non-Cartesian image reconstruction package for heterogeneous platforms and applications to MRI
This paper reports the development of a Python Non-Uniform Fast Fourier Transform (PyNUFFT) package, which accelerates non-Cartesian image reconstruction on heterogeneous platforms. Scientific computing with Python encompasses a mature and integrated environment. The NUFFT algorithm has been extensively used for non-Cartesian image reconstruction but previously there was no native Python NUFFT ...
متن کاملRapid Non-Cartesian Regularized SENSE Reconstruction using a Point Spread Function Model
Synopsis Iterative reconstructions of undersampled non-Cartesian data are computationally expensive because non-Cartesian Fourier transforms are much less e cient than Cartesian Fast Fourier Transforms. Here, we introduce an algorithm that does not require non-uniform Fourier transforms during optimization iterations, resulting in large reductions in computation times with no impairment of imag...
متن کاملNuts & Bolts of Advanced Imaging - Parallel Imaging
OBJECTIVES: This course aims to describe the effects of colored noise in the parallel MRI [1– 3] experiment and how to perform a reconstruction, which takes the noise distribution into consideration. Techniques for SNR scaled reconstruction [4] are described for Cartesian and non-Cartesian imaging. The course will also describe iterative reconstruction algorithms and their regularized forms. So...
متن کاملNon-Iterative Regularized reconstruction Algorithm for Non-CartesiAn MRI: NIRVANA.
We introduce a novel noniterative algorithm for the fast and accurate reconstruction of nonuniformly sampled MRI data. The proposed scheme derives the reconstructed image as the nonuniform inverse Fourier transform of a compensated dataset. We derive each sample in the compensated dataset as a weighted linear combination of a few measured k-space samples. The specific k-space samples and the we...
متن کامل